By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 29, Issue 5, pp. 1401-1759

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Robust Plane Sweep for Intersecting Segments

Jean-Daniel Boissonnat and Franco P. Preparata

pp. 1401-1421

BibTeX  Abstract Full Text:  PDF

Binary Space Partitions for Fat Rectangles

Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, and Jeffrey Scott Vitter

pp. 1422-1448

BibTeX  Abstract Full Text:  PDF

Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

Michael Saks and Fotios Zaharoglou

pp. 1449-1483

BibTeX  Abstract Full Text:  PDF

An Optimal Algorithm for Monte Carlo Estimation

Paul Dagum, Richard Karp, Michael Luby, and Sheldon Ross

pp. 1484-1496

BibTeX  Abstract Full Text:  PDF

Separating Complexity Classes Using Autoreducibility

Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, and Leen Torenvliet

pp. 1497-1520

BibTeX  Abstract Full Text:  PDF

Maintenance of 2- and 3-Edge-Connected Components of Graphs II

Han La Poutré

pp. 1521-1549

BibTeX  Abstract Full Text:  PDF

Restructuring Partitioned Normal Form Relations without Information Loss

Millist W. Vincent. and Mark Levene.

pp. 1550-1567

BibTeX  Abstract Full Text:  PDF

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors

Ming-Yang Kao and Jie Wang

pp. 1568-1576

BibTeX  Abstract Full Text:  PDF

Precision-Sensitive Euclidean Shortest Path in 3-Space

Jürgen Sellen, Joonsoo Choi, and Chee-Keng Yap

pp. 1577-1595

BibTeX  Abstract Full Text:  PDF

Optimal Information Gathering on the Internet with Time and Cost Constraints

Oren Etzioni, Steve Hanks, Tao Jiang, and Omid Madani

pp. 1596-1620

BibTeX  Abstract Full Text:  PDF

Virtual Path Layouts in ATM Networks

Ladislav Stacho and Imrich Vrto

pp. 1621-1629

BibTeX  Abstract Full Text:  PDF

Self-Testing without the Generator Bottleneck

Funda Ergün, S. Ravi Kumar, and D. Sivakumar

pp. 1630-1651

BibTeX  Abstract Full Text:  PDF

Safe Constraint Queries

Michael Benedikt and Leonid Libkin

pp. 1652-1682

BibTeX  Abstract Full Text:  PDF

On Broadcast Disk Paging

Sanjeev Khanna and Vincenzo Liberatore

pp. 1683-1702

BibTeX  Abstract Full Text:  PDF

Contention Resolution in Hashing Based Shared Memory Simulations

Artur Czumaj, Friedhelm Meyer auf Heide, and Volker Stemann

pp. 1703-1739

BibTeX  Abstract Full Text:  PDF

All-Pairs Almost Shortest Paths

Dorit Dor, Shay Halperin, and Uri Zwick

pp. 1740-1759

BibTeX  Abstract Full Text:  PDF